Geometrical Relations Between Space–Time Block Code Designs and Complexity Reduction
نویسندگان
چکیده
منابع مشابه
2 00 5 Geometrical relations between space time block code designs and complexity reduction ∗
In this work, the natural geometric relation between the space time block code design for the unknown channel at the receiver and its counterpart design for the known channel at the receiver is exploited, to establish an estimate on the corresponding diversities. This leads to a decomposition result and splits the code design problem into two complexity reduced sub tasks. Moreover a geometrical...
متن کاملGeometrical relations between space time block code designs and complexity reduction
In this work, the geometric relation between space time block code design for the coherent channel and its noncoherent counterpart is exploited to get an analogue of the information theoretic inequality I(X;S) I((X;H);S) in terms of diversity. It provides a lower bound on the performance of non-coherent codes when used in coherent scenarios. This leads in turn to a code design decomposition res...
متن کامل3 Relations Between Randomized Complexity Classes and Other Complexity Classes
Proof Fix a satisfying assignment a. Define the distance of r to a, denoted dist(r, a), as the number of coordinates where ri 6= ai (this is called Hamming distance). Let r = r, r, r, · · · be the assignments generated by the algorithm, and let di = dist(r , a). Note that as we only change one bit of the assignment, di+1 = di + ∆i where ∆i ∈ {−1, 1}. We claim that Pr[∆i = −1] ≥ 1/2. Once this i...
متن کاملLinks Between Complexity Theory and Constrained Block
The goal of this paper is to establish links between computational complexity theory and the theory and practice of constrained block coding. In particular, the complexities of several fundamental problems in constrained block coding are precisely classiied in terms of the existing complexity-theoretic structure. One type of problem studied is that of designing encoder and decoder circuits usin...
متن کاملOn relations between counting communication complexity classes
We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. This extends the investigation of the complexity of communication between two processors in terms of complexity classes initiated by Babai, Frankl, and Simon [Proc. 27th IEEE FOCS 1986, pp. 337{347] and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2006.885457